Hardware Reduction for Lut–Based Mealy FSMs
نویسندگان
چکیده
منابع مشابه
Synthesis of FSMs on the Basis of Reusable Hardware Templates
This paper suggests a reusable hardware template (HT) for finite state machines (FSM) and a method for the synthesis of FSMs based on such a template. The HT is a circuit with a predefined structure that has already been implemented in hardware (for example, in FPGA). By reprogramming its RAM-blocks we can implement a different functionality of the FSM. The proposed method permits the translati...
متن کاملComputational Complementarity for Mealy Automata
In this paper we extend (and study) two computational comple-mentarity principles from Moore to Mealy automata which are nite machines possessing better \quantum-like" features. We conjecture that both computational complementarity principles are incompatible with Svozil's deenition of reversibility; experimental evidence is given in support.
متن کاملDistinguishing Sequences for Partially Specified FSMs
Distinguishing Sequences (DSs) are used in many Finite State Machine (FSM) based test techniques. Although Partially Specified FSMs (PSFSMs) generalise FSMs, the computational complexity of constructing Adaptive and Preset DSs (ADSs/PDSs) for PSFSMs has not been addressed. This paper shows that it is possible to check the existence of an ADS in polynomial time but the corresponding problem for ...
متن کاملLearning Nondeterministic Mealy Machines
In applications where abstract models of reactive systems are to be inferred, one important challenge is that the behavior of such systems can be inherently nondeterministic. To cope with this challenge, we developed an algorithm to infer nondeterministic computation models in the form of Mealy machines. We introduce our approach and provide extensive experimental results to assess its potentia...
متن کاملEfficient Inference of Mealy Machines
Automata learning is increasingly being applied to ease the testing and comparing of complex systems. We formally reconstruct an efficient algorithm for the inference of Mealy machines, prove its correctness, and show that equivalence queries are not required for nonminimal hypotheses. In fact, we are able to evade those by applying a minor optimization to the algorithm. As a corollary, standar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Mathematics and Computer Science
سال: 2018
ISSN: 2083-8492
DOI: 10.2478/amcs-2018-0046